Convexification of polygons by flips and by flipturns
نویسندگان
چکیده
Simple polygons can be made convex by a finite number of flips, or of flipturns. These results are extended to very general polygons.
منابع مشابه
Polygons Needing Many Flipturns
A flipturn on a polygon consists of reversing the order of edges inside a pocket of the polygon, without changing lengths or slopes. Any polygon with n edges must be convexified after at most (n− 1)! flipturns. A recent paper showed that in fact it will be convex after at most n(n−3)/2 flipturns. We give here lower bounds. We construct a polygon such that if pockets are chosen in a bad way, at ...
متن کاملVertex Pops and Popturns
This paper considers transformations of a planar polygon P according to two types of operations. A vertex pop (or a pop) reflects a vertex vi, i ∈ {1, . . . , n}, across the line through the two adjacent vertices vi−1 and vi+1 (where index arithmetic is modulo n). A popturn rotates vi in the plane by 180◦ about the midpoint of the line segment vi−1vi+1. Pops and popturns are polygon reconfigura...
متن کاملOn convexification of polygons by pops
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be convexified by pop operations. This family contains simple, as well as non-simple (i.e., self-intersecting) polygons, as desired. We thereby answer in the negative an...
متن کاملFlipping edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...
متن کاملFlipping Edges on Triangulations
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. We prove that if a polygon Qn has k reflex vertices, then any triangulation of Qn can be transformed to another triangulation of Qn with at most O(n + k 2 ) flips. We produce examples of polygons with two triangulations T and T such that to transform T to T requires O(n ) flips. These results are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 241 شماره
صفحات -
تاریخ انتشار 2001